The Contribution of Hot Electron Spin Polarization to the Magnetotransport in a Spin-Valve Transistor at Finite Temperatures

The effect of spin mixing due to thermal spin waves and temperature dependence of hot electron spin polarization to the collector current in a spin-valve transistor has been theoretically explored. We calculate the collector current as well as the temperature dependence of magnetocurrent at finite temperatures to investigate the relative importance of spin mixing and hot electron spin polarization. In this study the inelastic scattering events in ferromagnetic layers have been taken into account to explore our interests. The theoretical calculations suggest that the temperature dependence of hot electron spin polarization has substantial contribution to the magnetotransport in the spin-valve transistor.Comment: 8 pages and 6 figure

First-principles study of crystallographic slip modes in ω-Zr.

We use first-principles density functional theory to study the preferred modes of slip in the high-pressure ω phase of Zr. The generalized stacking fault energy surfaces associated with shearing on nine distinct crystallographic slip modes in the hexagonal ω-Zr crystal are calculated, from which characteristics such as ideal shear stress, the dislocation Burgers vector, and possible accompanying atomic shuffles, are extracted. Comparison of energy barriers and ideal shear stresses suggests that the favorable modes are prismatic 〈c〉, prismatic-II [Formula: see text] and pyramidal-II 〈c + a〉, which are distinct from the ground state hexagonal close packed α phase of Zr. Operation of these three modes can accommodate any deformation state. The relative preferences among the identified slip modes are examined using a mean-field crystal plasticity model and comparing the calculated deformation texture with the measurement. Knowledge of the basic crystallographic modes of slip is critical to understanding and analyzing the plastic deformation behavior of ω-Zr or mixed α-ω phase-Zr

Political Economy of Tribal Development : A Case Study of Andhra Pradesh

The tribal population in the State of Andhra Pradesh, and in the country as a whole, is the most deprived and vulnerable community that faces severe economic exclusion. Although certain constitutional safeguards are provided, no significant economic, social and political mobility has taken place across this community. Contrary to Scheduled Castes and other Backward Castes who witnessed certain degrees of progress because of protective discrimination policies of the government, the Scheduled Tribes remain abysmally backward and socially excluded, still living in harsh environs. Our paper on "Political Economy of Tribal Development : A Case Study of Andhra Pradesh", delineates the situation of the Scheduled Tribes in the background of various policies of the state during the successive plan periods and its impact on their socio-economic mobility. Politically, this community is the most voiceless in the state. Their unsecured livelihood position in terms of lack of legal entitlements of the resources they use, both land and non-timber forest produce, push them into deep economic vulnerability. The paper also discusses the implications of the new act - Forest Right Act, 2006, on the livelihood security of the tribal communities and whether this act will finally lead to the inclusion of these people into the mainstream.Andhra Pradesh, India, economic exclusion, caste system, socio-economic mobility, Forest Right Act 2006

Common Neighbor Polynomial Of Some Special Trees

Vertex similarity of nodes is a well studied concept in graph theory as it is highly significant in various fields such as in the study of molecular structure of chemical graphs, measuring consensus rate of different individuals/organizations in network analysis etc. The number of common neighbors shared by two nodes in a network system can be treated as a measure of consensus among the corresponding individuals. This motivates the authors to define the $i$-common neighbor set and the common neighbor polynomial of a graph.Let $G(V,E)$ be a graph (simple graph) of order $n$ with vertex set $V$ and edge set $E$. Let $(u,v)$ denotes an un ordered vertex pair of distinct vertices of $G$ and let $N(u)$ denote the open neighborhood of the vertex $u$ in $G$. The $i$-common neighbor set of $G$ is defined as $N(G,i):=\{(u,v):u, v\in V, u\neq v \ \text{and}\ |N(u)\cap N(v)|=i\}$, for $0\leq i \leq n-2$. The polynomial $N[G;x]=\sum_{i=0}^{(n-2)} |N(G,i)| x^{i}$ is defined as the common neighbor polynomial of $G$. This polynomial was introduced by the present authors in 2017.Trees are commonly used to represent hierarchical data structures involved in network file system, possibility spaces, algorithmic routing etc. It is easy to dissect a tree data structure to access the information about a particular part of a huge data. Due to this reason, many researches were conducted to explore the properties of trees. In this paper, we derive the common neighbor polynomial of some special trees like rooted trees, caterpillars etc